Graphs with three distinct eigenvalues and largest eigenvalue less than
نویسنده
چکیده
Article history: Received 13 June 2008 Accepted 13 November 2008 Available online xxxx Submitted by R.A. Brualdi AMS classification: 05C50
منابع مشابه
Graphs with fourth Laplacian eigenvalue less than two
In this paper, all connected graphs with the fourth largest Laplacian eigenvalue less than two are determined, which are used to characterize all connected graphs with exactly three Laplacian eigenvalues no less than two. Moreover, we determine bipartite graphs such that the adjacency matrices of their line graphs have exactly three nonnegative eigenvalues. © 2003 Elsevier Ltd. All rights reser...
متن کاملBipartite graphs with small third Laplacian eigenvalue
In this paper, all connected bipartite graphs are characterized whose third largest Laplacian eigenvalue is less than three. Moreover, the result is used to characterize all connected bipartite graphs with exactly two Laplacian eigenvalues not less than three, and all connected line graphs of bipartite graphs with the third eigenvalue of their adjacency matrices less than one. c © 2003 Elsevier...
متن کاملOn the limit points of the smallest eigenvalues of regular graphs
In this paper, we give infinitely many examples of (non-isomorphic) connected k-regular graphs with smallest eigenvalue in half open interval [−1− √ 2,−2) and also infinitely many examples of (non-isomorphic) connected k-regular graphs with smallest eigenvalue in half open interval [α1,−1− √ 2) where α1 is the smallest root(≈ −2.4812) of the polynomial x3 + 2x2 − 2x − 2. From these results, we ...
متن کاملMore on Graphs with Just Three Distinct Eigenvalues
Let G be a graph of order n with (0, 1)-adjacency matrix A. An eigenvalue σ of A is said to be an eigenvalue of G, and σ is a main eigenvalue if the eigenspace EA(σ) is not orthogonal to the all-1 vector in IR. Always the largest eigenvalue, or index, of G is a main eigenvalue, and it is the only main eigenvalue if and only if G is regular. We say that G is an integral graph if every eigenvalue...
متن کاملEigenvalues and edge-connectivity of regular graphs
In this paper, we show that if the second largest eigenvalue of a d-regular graph is less than d − 2(k−1) d+1 , then the graph is k-edge-connected. When k is 2 or 3, we prove stronger results. Let ρ(d) denote the largest root of x3 − (d− 3)x2 − (3d− 2)x− 2 = 0. We show that if the second largest eigenvalue of a d-regular graph G is less than ρ(d), then G is 2-edge-connected and we prove that if...
متن کامل